Infinite unfair shuffles and associativity
نویسندگان
چکیده
We consider a general shuffling operation for finite and infinite words which is not necessarily fair. This means that it may be the case that in a shuffle of two words, from some point onwards, one of these words prevails ad infinitum even though the other word still has letters to contribute. Prefixes and limits of shuffles are investigated, leading to a characterization of general shuffles in terms of shuffles of finite words, a result which does not hold for fair shuffles. Associativity of shuffling is an immediate corollary. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Associativity of Infinite Synchronized Shuffles and Team Automata
Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrences which preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a...
متن کاملShuffles and Synchronized Shuffles: A Survey
We present an overview of different approaches to define shuffles and synchronized shuffles of words. The shuffle operations considered are distinguished by conditions according to which certain occurrences of symbols common to the original words may or must be identified (synchronized). The words that are shuffled may be infinite which leads to the possibility of unfair shuffling. In addition ...
متن کاملInfinite hierarchies of nonlocal symmetries of the Chen–Kontsevich–Schwarz type for the oriented associativity equations
We construct infinite hierarchies of nonlocal higher symmetries for the oriented associativity equations using solutions of associated vector and scalar spectral problems. The hierarchies in question generalize those constructed by Chen, Kontsevich and Schwarz [40] for the WDVV equations. As a byproduct, we obtain a Darboux-type transformation and a (conditional) Bäcklund transformation for the...
متن کاملSquare-free shuffles of words
Let u v denote the set of all shuffles of the words u and v . It is shown that for each integer n ≥ 3 there exists a square-free ternary word u of length n such that u u contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word u on three letters such that u can be shuffled with itself to produce an infinite square-...
متن کاملDistributivity and associativity in effect algebras
We prove “large associativity” of the partial sum in effect algebras and present an overview of distributivity-like properties of partial operations ⊕ and in effect algebras with respect to (possibly infinite) suprema and infima and vice versa generalizing several previous results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 380 شماره
صفحات -
تاریخ انتشار 2007